Edit Tree Distance Alignments for Semantic Role Labelling
نویسنده
چکیده
―Tree SRL system‖ is a Semantic Role Labelling supervised system based on a tree-distance algorithm and a simple k-NN implementation. The novelty of the system lies in comparing the sentences as tree structures with multiple relations instead of extracting vectors of features for each relation and classifying them. The system was tested with the English CoNLL-2009 shared task data set where 79% accuracy was obtained.
منابع مشابه
Projecting semantic roles via Tai mappings
This work takes the paradigm of projecting annotations within labelled data into unlabelled data, via a mapping, and applies it to Semantic Role Labelling. The projections are amongst dependency trees and the mappings are the Tai-mappings that underlie the well known tree edit-distance algorithm. The system was evaluated in seven different languages. A number of variants are explored relating t...
متن کاملImproving Semantic SMT via Soft Semantic Role Label Constraints on ITG Alignments
We show that applying semantic role label constraints to bracketing ITG alignment to train MT systems improves the quality of MT output in comparison to the conventional BITG and GIZA alignments. Moreover, we show that applying soft constraints to SRL-constrained BITG alignment leads to a better translation system compared to using hard constraints which appear too harsh to produce meaningful b...
متن کاملApplication of latent semantic indexing to evaluate the similarity of sets of sequences without multiple alignments character-by-character.
Most molecular analyses, including phylogenetic inference, are based on sequence alignments. We present an algorithm that estimates relatedness between biomolecules without the requirement of sequence alignment by using a protein frequency matrix that is reduced by singular value decomposition (SVD), in a latent semantic index information retrieval system. Two databases were used: one with 832 ...
متن کاملStanford: Probabilistic Edit Distance Metrics for STS
This paper describes Stanford University’s submission to SemEval 2012 Semantic Textual Similarity (STS) shared evaluation task. Our proposed metric computes probabilistic edit distance as predictions of semantic similarity. We learn weighted edit distance in a probabilistic finite state machine (pFSM) model, where state transitions correspond to edit operations. While standard edit distance mod...
متن کاملProbabilistic Tree-Edit Models with Structured Latent Variables for Textual Entailment and Question Answering
A range of Natural Language Processing tasks involve making judgments about the semantic relatedness of a pair of sentences, such as Recognizing Textual Entailment (RTE) and answer selection for Question Answering (QA). A key challenge that these tasks face in common is the lack of explicit alignment annotation between a sentence pair. We capture the alignment by using a novel probabilistic mod...
متن کامل